Method and system for partitioning and encoding of uncompressed video for transmission over wireless medium

ABSTRACT

A method and system for transmitting uncompressed video over a wireless channel by inputting a frame of pixel information, partitioning spatially correlated pixels into different packets, and transmitting the packets separately over a wireless channel. For robust transmission, error detection data can be generated for each packet and appended to each packet before transmission. A receiver receives the transmitted packets and checks if a received packet is corrupt based on the appended error detection data. For a corrupt packet, the receiver corrects the corrupt pixels using pixel information in other received packets containing neighboring pixels to recover each corrupt pixel in the corrupt packet.

RELATED APPLICATION

This application claims priority from U.S. Provisional PatentApplication Ser. No. 60/773,826, filed on Feb. 15, 2006, incorporatedherein by reference.

FIELD OF THE INVENTION

The present invention relates to wireless communication and inparticular to transmission of uncompressed video over wirelesscommunication channels.

BACKGROUND OF THE INVENTION

With the proliferation of high quality video, an increasing number ofelectronic devices (e.g., consumer electronic devices) utilizehigh-definition (HD) video. Conventionally, most devices compress the HDvideo, which can be around 1 Gbps (giga bits per second) in bandwidth,to a fraction of its size to allow for transmission between devices.However, with each compression and subsequent decompression of thevideo, some video information can be lost and the picture quality isdegraded.

The High-Definition Multimedia Interface (HDMI) specification defines aninterface for uncompressed HD transmission between devices through HDMIcables (wired links). Three separate channels are used to transmit threecomponent streams (R, G, B or Y, Cb, Cr). For each channel, pixels aretransmitted in pixel-by-pixel order for each video line, andline-by-line for each video frame or field. The HDMI providespixel-repetition functionality which repeats each pixel one or multipletimes. The copies of each pixel directly follow the original pixelduring the transmission at each component channel.

Existing Wireless Local Area Networks (WLANs) and similar technologiesdo not have the bandwidth needed to carry uncompressed HD video, such asproviding an air interface to transmit uncompressed video over a 60 GHzbandwidth. Further, existing WLANs can suffer from interference issueswhen several devices are connected, leading to video signal degradation.

BRIEF SUMMARY OF THE INVENTION

The present invention provides a method and system for spatial videopixel partitioning and encoding for transmission of uncompressed videoover wireless communication channels. In one implementation, this allowstransmission of uncompressed HD video from a transmitter to a receiverover a wireless channel, and further allows error recovery at thereceiver.

An example involves inputting a frame of pixel information, andpartitioning spatially correlated pixels. Then, the partitioned pixelsare placed into different packets and error detection information isgenerated for each packet and appended thereto. The packets are thentransmitted by a transmitter to a receiver over a wireless channel.Based on the appended error detection data in each packet, the receiverdetermines if a received packet is corrupt. If a packet is corrupt, thenthe receiver recovers the corrupt pixels using pixel information inother received packets containing neighboring pixels. As a result,retransmission of corrupt pixels is not required. This improvestransmission robustness and reduces channel bandwidth requirements.

Preferably, the partitioned pixels are placed into packets such thatpixels with minimal spatial distance (i.e., neighboring pixels) areplaced into different packets for transmission over the wirelesschannel. This can further include partitioning spatially correlatedpixels into K different partitions, and selecting the value of then^(th) pixel at each K pixel block as base information. Then, the baseinformation is placed in a packet as BASE pixels, and information ofother pixels in the pixel block is encoded within the same block andplaced in another packet as DIFF pixels.

In accordance with further features of a preferred embodiment of thepresent invention, recovering the corrupt pixels further includesdetermining a difference between each corrupt pixel in a corrupt packetwith a corresponding pixel of an adjacent non-corrupt packet, and if thedifference is greater than a threshold, then correcting each corruptpixel using pixel information in that adjacent non-corrupt packet. Suchcorrecting steps can be performed by replacing each corrupt pixel with acorresponding pixel in the adjacent non-corrupt packet, or by using anaverage of neighboring pixels of a corresponding pixel in thenon-corrupt packet.

These and other features, aspects and advantages of the presentinvention will become understood with reference to the followingdescription, appended claims and accompanying figures.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 shows a flowchart of an embodiment of a process for spatialpartitioning of uncompressed video pixels for transmission over awireless channel, according to an embodiment of the present invention.

FIG. 2 shows an example of spatial partitioning of pixels into twopartition packets, according to an embodiment of the present invention.

FIGS. 3A-B show further examples of spatial partitioning of pixels intofour partition packets, according to embodiments of the presentinvention.

FIG. 4 shows a flowchart of an embodiment of a process for processingpackets received at a receiver, according to an embodiment of thepresent invention

FIG. 5 shows a functional block diagram of an example communicationsystem implementing spatial pixel partitioning and encoding mechanismsfor transmission of uncompressed HD video over a wireless channel,according to an embodiment of the present invention.

FIG. 6 shows an example of differential pulse code modulation (DPCM) orbinary XOR (bXOR) encoding for DIFF pixels, according to an embodimentof the present invention.

FIG. 7 shows an example of DPCM (or bXOR) and run-length coding (RLC)coding for DIFF pixels, according to an embodiment of the presentinvention.

In the drawings, like references refer to similar elements.

DETAILED DESCRIPTION OF THE INVENTION

The present invention provides a method and system for spatial videopixel partitioning and encoding for transmission of uncompressed video,such as over wireless communication channels. In one implementation,this allows transmission of uncompressed HD video from a transmitter toa receiver over a wireless channel.

There are two categories of HD video formats according to a display scanscheme: interlaced and progressive. In the progressive scheme the pixelsare scanned line-by-line. However, in the interlaced scheme the pixelsare scanned every other line and one video frame is divided into twosub-frames called odd line field and even line field. In each videoframe, usually the neighboring pixels have very similar or even the samevalues. This type of spatial redundancy can be used in wirelesstransmission to improve video quality.

According to said embodiment of the present invention, neighboringpixels in a video frame are partitioned into different packets andtransmitted separately over wireless channels from a transmitter to areceiver. If one packet is received corrupted (i.e., pixels lost orreceived with errors), then packets carrying the neighboring pixels areused to recover the pixels in the corrupt packet. As such,retransmission of lost information is not required, which savestransmission bandwidth.

Wireless transmission of uncompressed HD video (WiHD) requires higherMedium Access Control (MAC) packet transmission efficiency. Due to suchhigh MAC efficiency requirements (and a relatively static channel), aWiHD packet can be very long (i.e., typically 300K-600K bits long). Thepresent invention further provides the option of encoding pixels basedon said spatial pixel partitioning method, which conserves transmissionbandwidth.

FIG. 1 shows a flowchart 10 of an embodiment of a process forpartitioning video pixels at a wireless transmitter, according to anembodiment of the present invention, including the steps of:

-   -   Step 11: Input video pixels.    -   Step 12: Determine a number of partitions K, and partition the        pixels into K different partitions.    -   Step 14: Construct a MAC packet for each partition (i.e.,        packetizing), and place the corresponding partition pixels into        the MAC packet.    -   Step 16: Determine error detection data (e.g., such as Cyclic        Redundancy Code (CRC)) for each MAC packet, and append the error        detection data to the MAC packet. Such a MAC packet is an        example of a WiHD packet described above, for transmission from        a transmitter to a receiver over wireless channels.

FIG. 2 shows a diagrammatical example application of the abovepartitioning and packetizing steps for K=2 partitions. An uncompressedvideo frame 100 includes a set 101 of pixels 102. The spatial locationof each pixel 102 in the frame 100 can be identified by a column index i(horizontal), and a row index j (vertical). Each of the indices i and jcan take on integer values 0, 1, 2, 3, 4, etc.

The pixels 102 are split horizontally into two groups: (1) the firstgroup of pixels (marked as “X”) have indices i=0, 2, 4, . . . , etc.,per line and indices j=0, 1, 2, . . . , etc.; and (2) the second groupof pixels (marked as “0”) have indices i=1, 3, 5, . . . , etc., per lineand indices j=0, 1, 2, . . . , etc. Then, as shown in FIG. 1, pixelsfrom the first group are placed in a first packet 103A (i.e., Packet 0),and pixels from the second group are placed in a second packet 103B(i.e., Packet 1). Therefore, one or more pixels of first group areplaced in the Packet 0, and one or more pixels of second group areplaced in the Packet 1. As a result, spatially neighboring pixels arepartitioned and placed into different packets.

Packet size is selected depending on transmitter and receiver bufferrequirements. One or more lines worth of pixels can be placed in eachpacket. A CRC for each packet is computed and appended at the end of thepacket before transmission to a receiver over a wireless channel.

In the uncompressed video frame 100, geographically neighboring(spatially correlated) pixels usually have very similar, or even thesame values. Regardless of how pixel partitioning is performed, so longas spatially neighboring pixels are partitioned and placed intodifferent packets for transmission, then if pixel information in areceived packet is corrupted (i.e., lost or damaged), one or more otherpackets which contain pixels that are spatially related to the corruptpixel(s) can be used to recover (compensate for) the corrupt pixelinformation.

There are many approaches for recovering a lost or erroneous pixel P.One approach involves simply copying a pixel Q from a neighboringpacket, wherein preferably pixel Q is spatially correlated to pixel P.Another approach involves using a combination (e.g., the average value)of pixels R in neighboring packets, wherein preferably pixels R arespatially correlated to pixel P. Other approaches for recovering a lostor erroneous pixel based on the neighboring pixels can be utilized, asthose skilled in the art will recognize.

Preferably, partitioning is performed such that pixels with minimalspatial distance are placed into different packets for transmission overa wireless channel. Further, partitioning can be performed bydistributing y number of spatially correlated pixels into z number ofdifferent packets, wherein y≠z. In one example, y can be greater than z,whereby at least one of the packets includes two or more spatiallycorrelated (neighboring) pixels from a partition. It is also possible tosplit pixels vertically. However, for interlaced format, since twoneighboring lines are already split into two separate fields, it ispreferable to partition horizontally for each field if only twopartitions are required.

If more than two partitions are needed, then a combination of horizontaland vertical partitioning can be considered, as well as horizontalsplitting or vertical splitting. Additional examples of partitioningaccording to the present invention wherein pixels are partitioned intomore than two groups are provided below.

FIG. 3A shows an example application of the partitioning and packetizingsteps for K=4 partitions. In this example, the pixels are split into,four types (i.e., types 0, 1, 2, 3) of 2×2 blocks 104, wherein K=4pixels per block. The four pixels in each 2×2 block 104 are placed into4 different packets (i.e., Packets 0, 1, 2, 3) as shown. Pixels withminimal spatial distance are placed into different packets fortransmission.

Specifically, for the type 0 pixels, the indices i and j are evennumbers (i.e., i=0, 2, 4, . . . , etc., and j=0, 2, 4, . . . , etc.),and the type 0 pixels are placed in the Packet 0. For the type 1 pixels,the index i is odd (i.e., i=1, 3, 5, . . . , etc.), the index j is even(i.e., j=0, 2, 4, . . . , etc.), and the type 1 pixels are placed in thePacket 1. For the type 2 pixels, the index i is even (i.e., i=0, 2, 4, .. . , etc.), the index j is odd (i.e., j=1, 3, 5, . . . , etc.), and thetype 2 pixels are placed in the Packet 2. For the type 3 pixels, theindices i and j are odd numbers (i.e., i=1, 3, 5, . . . , etc., and j=1,3, 5, . . . , etc.), and the type 3 pixels are placed in the Packet 3. ACRC for each packet is appended at the end of the packet beforetransmission to a receiver of a wireless channel.

If during transmission, a pixel in one packet (e.g., Packet 0) iscorrupted, then spatially related pixels in the other three packets(e.g., Packets 1, 2, or 3) can be used at the receiver to compensate forthe corrupted pixel. As such, if pixel information in position P in apacket (e.g., Packet 0 in FIG. 5) is corrupted, then the pixelinformation in position P in other spatially related packets (e.g.,Packets 1, 2, or 3) can be used to compensate for the corruptedinformation.

Different packets can be transmitted at a single channel or at differentchannels/paths. In addition to robustness improvement, in the case whenone channel/path cannot meet the bandwidth requirement for a HD stream,spatial pixel partitioning can take advantage of multi-channel/path totransmit all data of a HD video stream.

In general, square/rectangular blocks 104 (each block including multiplepixels therein), can be used for partitioning the multiple pixels ineach block into corresponding multiple packets, wherein for each block,preferably each pixel in that block is placed in a different packet fortransmission.

FIG. 3B shows an example application of the partitioning and packetizingsteps for K=4 partitions. In this example, the pixels are again splitinto, four types (i.e., types 0, 1, 2, 3) of 1×4 blocks 104, wherein K=4pixels per block. In this example, the blocks 104 are rectangular blockscompared to square blocks in the example shown in FIG. 3A.

In the example show in FIG. 3B, the four pixels in each 1×4 rectangularblock 104 are placed into 4 different packets (i.e., Packets 0, 1, 2, 3)as shown. Specifically, for the type 0 pixels, the index i=3, 7, 11, . .. , etc., the index j=0, 1, 2, 3, . . . , etc., and the type 0 pixelsare placed in the Packet 0. For the type 1 pixels, the index i 2, 6, 10,. . . , etc., the index j=0, 1, 2, 3, . . . , etc., and the type 1pixels are placed in the Packet 1. For the type 2 pixels, the index i=1,5, 9, . . . , etc., the index j=0, 1, 2, 3, . . . , etc., and the type 2pixels are placed in the Packet 2. For the type 3 pixels, the index i=0,4, 8, . . . , etc., the index j=0, 1, 2, 3, . . . , etc., and the type 3pixels are placed in the Packet 3. In general, the index j=0, 1, 2, 3,4, 5, . . . , etc., and the index i=(K-t) wherein t=1, 2, 3, . . . , K,and K=4 in this example.

At the receiver, the received packets are processed for errors. Whenbased on a CRC check a packet is determined to be corrupt, in order todetermine the corrupted pixels, all the pixels in the corrupt packet arecompared with corresponding pixels in an adjacent non-corrupt packet, ona pixel-by-pixel basis. If there is a sharp change (i.e., greater than apre-defined threshold) between two corresponding pixels which belong todifferent partitions/packets, then the pixel in the corrupt packet islikely wrong, and it is corrected based on adjacent packets (describedbelow). Otherwise, the pixel is used as is.

FIG. 4 shows a flowchart 20 of the steps for processing packets receivedat a receiver in an embodiment of the invention, including the steps of:

-   -   Step 21: Receive a packet.    -   Step 22: Check the CRC for a received packet.    -   Step 24: Based on the CRC, determine if the packet is corrupt        (i.e., lost or erroneous pixel values). If not, go to step 26,        otherwise go to step 28.    -   Step 26: Pass the received packet to higher layers for display.        Go to step 21 to process the next packet.    -   Step 28: Determine a difference between each pixel in the        corrupt packet with a corresponding pixel of an adjacent        non-corrupt packet.    -   Step 30: Determine if the difference is greater than a        threshold. If not, go to step 32, otherwise go to step 34.    -   Step 32: Retain the pixel. Go to step 36.    -   Step 34: Correct the pixel. In one example (e.g., K=2        partitions), correcting the pixel includes replacing the pixel        in the corrupt packet with a corresponding pixel of the adjacent        non-corrupt packet. In another example (K=4 partitions),        correcting a corrupt pixel includes replacing the pixel in the        corrupt packet with the average value of the neighboring pixels        of an adjacent non-corrupted packet.    -   Step 36: Determine if any other pixels remain in the corrupt        packet for processing. If not, go to step 38, otherwise go back        to step 28.    -   Step 38: Pass the packet to higher levels for display. Go back        to step 21.

Each received packet is processed according to the above steps for errordetection and recovery.

FIG. 5 shows a functional block diagram of an example wirelesscommunication system 200, according to an embodiment of the presentinvention. The system 200 includes a WiHD transmitter 202 and a WiHDreceiver 204. The transmitter 202 includes a physical (PHY) layer 206and a MAC layer 208. Similarly, the receiver 204 includes a PHY layer214 and a MAC layer 216. The PHY and MAC layers enable wirelesscommunication between the WiHD transmitter 202 and the WiHD receiver 204via transmit antennas 203 and receiver antennas 205, respectively, overa wireless channel 201.

The transmitter 202 further includes a partitioning module 210 thatreceives video frames and implements the above partitioning steps onuncompressed video from higher layers, and a packetization and encodingmodule 212 that generates packets of data. The MAC layer 208 convertseach data packet into a MAC packet by adding a MAC header to each datapacket, and further calculates and adds CRC information to the datapacket. The MAC packets are then provided to the PHY layer 206. The PHYlayer 206 adds a PHY header to each MAC packet for transmission to theWiHD receiver 204 via transmit antennas 203.

In the receiver 204, the PHY layer 214 receives transmitted packets. TheMAC layer 216 processes each received packet and performs errordetection and error recovery according to the steps in the flowchart ofFIG. 6. The WiHD receiver 204 further includes a de-packetization anddecoding module 217 and a de-partitioning module 218. Thede-packetization and decoding module 217 receives the processed packetsfrom the MAC layer 216 and provides the bits in the packets to thede-partitioning module 218. The de-partitioning module 218 performs aninverse partitioning method of the partitioning module 210 to regeneratea video frame from the partitioned pixels in the packets.

The receiver 204 further includes an error detection module 219 and arepair module 220. The error detection module 219 detects lost ordamaged pixels in packets (e.g., using CRC information). The repairmodule 220 utilizes information from neighboring pixels, as described,to compensate for that lost or damaged pixel when the de-partitioningmodule 218 performs said inverse partitioning steps. In one example, thedetection module 219 and a repair module 220 performs the process stepsin the flowchart of FIG. 4. In one example implementation, the detectionmodule 219 and the repair module 220 can be logical components of theMAC layer 216 in the receiver 204.

In another example implementation, the MAC layer 208, the partitioningmodule 210, and the packetization and encoding 212 in the WiHDtransmitter 202 are logical modules. As such, though in the example ofFIG. 5 the partitioning module 210 and the packetization and encodingmodule 212 are shown as separate from the MAC layer 208, in anotherexample, one or both of the logical modules 210 and 212 can be acomponent of the MAC layer 208. Similarly, in the WiHD receiver 204, oneor both of the de-partitioning modules 218 and the de-packetization anddecoding module 217 can be components of the MAC layer 216.

In accordance with further features of the present invention, anencoding method is provided for conserving transmission bandwidth. Atypical HD video frame has M rows and N lines (columns), and a total ofM*N pixels (* means multiplication). Each pixel has D bits, wherein at aframe updating frequency of f frames per second (frames/sec), the datarate required for transmission of an HD video frame is M*N*D*f bits persecond. For example, in the 1080 p video format, each frame has 1920rows and 1080 lines, and each pixel has 24 bits, such that if the frameupdating frequency is 60 frame/sec, then the transmission data rate is1920*1080*24*60=2,985,984,000 bps. In some cases, it may be difficultfor wireless hardware and PHY layer to meet the bandwidth requirementsof uncompressed HD video transmission.

To solve this problem, according to another aspect of the presentinvention, first a pixel partitioning process as described above isapplied to partition the neighboring video pixels into K partitionswherein every K pixels form a block. Then, instead of placing alloriginal video pixel information into packets, the value of the n^(th)fixed position pixel is selected at every K pixel block as baseinformation (n<K), and information of other pixels in the block isencoded within the same block (e.g., by using differential pulse codemodulation (DPCM) or binary XOR (bXOR) encoding). The encoded pixels aretermed DIFF pixels and transmitted in DIFF packets, and the pixelscarrying the original video data are termed BASE pixels and transmittedin BASE packets.

Because spatially correlated pixels usually have very similar or eventhe same values, after DPCM or bXOR encoding, the Most Significant Bits(MSBs) of the DIFF pixels are mostly zero. In order to conservetransmission bandwidth, the zero bits need not be transmitted. Twoexample implementations of such an approach are hard truncation and RunLength Coding (RLC) as described below.

An example of hard truncation involves truncating the high order zerobits of encoded DIFF pixels, such that less number of bits is needed fortransmission. Assuming one pixel has D bits, for a BASE pixel all of theD bits are used to carry the original data information. However, for aDIFF pixel, D1 bits (D1<D) are used for DPCM or bXOR encoding.Preferably, the exact value of D1 is selected in advance, according tovideo content types. If D1 is selected to be less than the bits requiredto carry encoded information for a DIFF pixel, then the D1 bits are setto the value closest to the real encoded value.

FIG. 6 shows an example encoding scheme based on DPCM or bXOR encoding,wherein K=2 partitions. Similar to FIG. 1, in FIG. 6 the pixels aresplit horizontally into two groups: (1) the first group of pixels haveindices i=0, 2, 4, . . . , etc., and indices j=0, 1, 2, . . . , etc.;and (2) the second group of pixels have indices i=1, 3, 5, etc., andindices j=0, 1, 2, . . . , etc.

A first packet 107 (i.e., Packet 0) is constructed which includes D bits107A of the original data per pixel for said first group of pixels (BASEpixels). The first packet 107 is an example of a BASE packet. A secondpacket 109 (i.e., Packet 1) is constructed which includes D1 bits 109Afor said second group of pixels that are DPCM or bXOR encoded per pixel(DIFF pixels). The second packet 109 is an example of a DIFF packet. Inthis example where K=2, then D=24 and D1=12, wherein for each DIFFpixel, 12 bits are used for transmission after DPCM or bXOR encoding.

The above hard truncation example is a simple solution to reduce thetransmission bandwidth requirement. To avoid introduction of error forDIFF pixels, if D1 bits are insufficient for all of the bits of the DPCMor bXOR encoded value, then RLC is used for the DIFF pixels and the bitorder is re-organized in each DIFF packet to carry DIFF pixels.

FIG. 7 shows an example encoding scheme based on DPCM (or bXOR) and RLCfor DIFF pixels to protect BASE pixels wherein K=2 partitions. Similarto FIG. 6, in FIG. 7 the pixels are split horizontally into two groups:(1) the first group of pixels have the indices i=0, 2, 4, etc., and j=0,1, 2, . . . , etc.; and (2) the second group of pixels have indices i=1,3, 5, . . . , etc., and j=0, 1, 2, etc.

A first packet 110 (i.e., Packet 0) is constructed which includes D bits110A of the original data per pixel from said first group of pixels(BASE pixels). The first packet 110 is another example of a BASE packet.A second packet 112 (i.e., Packet 1) is constructed which includes datainformation after DPCM or bXOR encoding, re-organization and RLC, perpixel from said second group of pixels. The second packet 112 is anotherexample of a DIFF packet.

The bits of the DIFF pixels in a DIFF packet 112 are grouped andre-ordered according to their information significance in the pixel. Forexample, the first MSBs of all pixels are grouped together, which arefollowed by the second MSBs of all pixels, and so on, up to the LSBs(Least Significant Bits) of all pixels. Then, RLC is applied either tothe reorganized DIFF bits stream or to just the MSBs part of thereorganized bit stream. Since after DPCM or bXOR encoding most MSBs arezero, RLC can achieve high compression ratio without loss of anyinformation. Note that it is also possible to aggregate multiple DIFFpackets together to reduce various MAC layer overhead in wirelesstransmission.

The above encoding methods can be implemented in the transmitter 202 ofsystem 200 in FIG. 5, as a logical component of the packetization module212. The de-packetization module 217 in the receiver 204 then performsdecoding steps which are inverse of the encoding steps in thetransmitter 202.

As is known to those skilled in the art, the aforementioned examplearchitectures described above, according to the present invention, canbe implemented in many ways, such as program instructions for executionby a processor, as logic circuits, as an ASIC, as firmware, etc.

The present invention has been described in considerable detail withreference to certain preferred versions thereof; however, other versionsare possible. Therefore, the spirit and scope of the appended claimsshould not be limited to the description of the preferred versionscontained herein.

What is claimed is:
 1. A method of transmitting uncompressed video overa wireless channel, comprising: inputting a frame of uncompressed videopixel information; partitioning the frame into a plurality of pixelsets; partitioning neighboring spatially correlated pixels of each pixelset into different partitions based on pixel indexes, wherein theneighboring spatially correlated pixels are positioned directly next toone another; placing pixels from each partition of the differentpartitions into different packets, wherein the neighboring spatiallycorrelated pixels of each pixel set are partitioned from one another andplaced into the different packets such that each different packetcomprises non-neighboring adjacent pixels; and transmitting each packetseparately over the wireless channel, wherein partitioning neighboringspatially correlated pixels of each pixel set into different partitionsbased on pixel indexes comprises partitioning based on multiple pixelindex types comprising combinations of even and odd pixel indexes. 2.The method of claim 1 further comprising: receiving a transmittedpacket; checking if a received packet is corrupt; recovering corruptpixels using pixel information in other received packets containingneighboring spatially correlated pixels; and reconstructing the videoframe from the neighboring spatially correlated pixels in the packets.3. The method of claim 1 wherein recovering the corrupt pixels furtherincludes: determining a difference between each pixel in the corruptpacket with a corresponding pixel of an adjacent non-corrupt packet; andif the difference is greater than a threshold, then recovering eachcorrupt pixel using corresponding pixel information in the adjacentnon-corrupt packet.
 4. The method of claim 3 wherein recovering eachcorrupt pixel using pixel information in the adjacent non-corrupt packetfurther includes replacing each corrupt pixel with a corresponding pixelfrom the adjacent non-corrupt packet.
 5. The method of claim 4 whereinpartitioning further includes partitioning the pixels, such thatneighboring pixels with minimal spatial distance are placed intodifferent packets for transmission over the wireless channel.
 6. Themethod of claim 4 wherein partitioning further includes portioning thepixels into 2×2 blocks, and placing each pixel in a block in a differentpacket such that the pixels in a 2×2 block are individually separatedinto different packets.
 7. The method of claim 4 wherein partitioningfurther includes portioning the pixels into 1×4 blocks, and placing eachpixel in a block in a different packet.
 8. The method of claim 1 whereinpartitioning the pixels into different packets further includes:partitioning spatially correlated neighboring pixels into K differentpartitions, wherein K is a positive integer; selecting a value of then^(th) pixel at every K pixel block as base information, wherein n is apositive integer, and wherein n<K; for each block: placing the baseinformation in a packet as BASE pixels; and encoding information ofother pixels in the block as DIFF pixels, and placing the DIFF pixels inanother packet.
 9. The method of claim 8 further comprising, afterencoding, truncating MSBs with zero values before transmission of apacket.
 10. The method of claim 9 further comprising truncating highorder zero bits of encoded DIFF pixels.
 11. The method of claim 9further comprising performing RLC for the DIFF pixels and re-ordering abit order in each packet to carry DIFF pixels.
 12. The method of claim 8further comprising: receiving a transmitted packet; decoding the encodedpixels per packet; and reconstructing the video frame from the spatiallycorrelated neighboring pixels in the packets.
 13. The method of claim 1further comprising generating error detection data for each packet, andappending the error detection data to each packet before transmission.14. The method of claim 13 further comprising: receiving a transmittedpacket; based on the appended error detection data, checking if areceived packet is corrupt; recovering corrupt pixels using pixelinformation in other received packets containing neighboring spatiallycorrelated pixels; and reconstructing the video frame from theneighboring spatially correlated pixels in the packets.
 15. The methodof claim 1, further comprising: receiving the packets; and if pixelinformation in a received packet is corrupt, then using pixelinformation in other received packets containing neighboring pixels torecover a pixel in the corrupt packet, whereby retransmission of lostinformation is not required.
 16. The method of claim 15, whereinrecovering the lost pixel comprises copying a pixel from a neighboringpacket as the lost pixel information.
 17. The method of claim 15,wherein recovering the lost pixel comprises using an average value ofpixels in other neighboring packets as the lost pixel information. 18.The method of claim 1, wherein the partitioning comprises combinationsof vertical and horizontal partitioning of the spatially correlatedpixels.
 19. The method of claim 18, wherein the multiple pixel indextypes comprise even and odd pixel index combinations.
 20. The method ofclaim 1, wherein vertical and horizontal adjacent pixels are partitionedinto different packets.
 21. A wireless communication system comprising:a wireless transmitter including: a partitioning module inputsuncompressed video pixels from a video frame, partitions the video frameinto a plurality of pixel sets, and partitions neighboring pixels ofeach pixel set into different partitions based on pixel indexes, whereinthe neighboring pixels are positioned directly next to one another; apacketization module places the pixels from different partitions intodifferent packets for transmission separately over a wireless channel,wherein the neighboring pixels of each pixel set are partitioned fromone another and placed into the different packets such that eachdifferent packet comprises non-neighboring adjacent pixels; an errordetection information generator calculates error detection data for eachpacket and appends the error detection data to the packet beforetransmission; and a wireless receiver including: an error recoverymodule receives packets and checks for corrupt packets, and recovers acorrupt pixel in a corrupt packet using pixel information in otherreceived packets that contain neighboring pixels, wherein partitionsneighboring pixels of each pixel set into different partitions based onpixel indexes comprises partitioning based on multiple pixel index typescomprising combinations of even and odd pixel indexes.
 22. The system ofclaim 21 wherein the error recovery module determines a differencebetween each pixel in a corrupt packet and a corresponding pixel in anadjacent non-corrupt packet, such that if the difference is greater thana threshold, the error recovery module corrects a corrupt pixel usingpixel information in the adjacent non-corrupt packet.
 23. The system ofclaim 22 wherein the error recovery module corrects each corrupt pixelbased on an average value of neighboring pixels in the adjacentnon-corrupt packet.
 24. The system of claim 22 wherein the errorrecovery module corrects each corrupt pixel by replacing the corruptpixel with a corresponding pixel in the adjacent non-corrupt packet. 25.The system of claim 24 wherein the partitioning module partitions thepixels such that pixels with minimal spatial distance are placed intodifferent packets for separate transmission over the wireless channel.26. The system of claim 21 wherein: the partitioning module partitionsthe pixels into K different partitions, wherein K is a positive integer;the packetization module selects the value of an n^(th) pixel at every Kpixel block as base information, and for each block, place the baseinformation in a packet as BASE pixels, wherein n is a positive integer;and the transmitter further includes an encoder that encodes informationof other pixels in the block as DIFF pixels, and places the DIFF pixelsin another packet.
 27. The system of claim 26 wherein the encoderperforms encoding using DPCM encoding.
 28. The system of claim 26wherein the encoder performs encoding by bXOR encoding.
 29. The systemof claim 26 wherein the encoder eliminates MSBs with zero values beforetransmission.
 30. The system of claim 29 wherein the encoder truncateshigh order zero bits of encoded DIFF pixels.
 31. The system of claim 29wherein the encoder performs RLC for the DIFF pixels and re-orders thebit order in each packet to carry DIFF pixels.
 32. The system of claim21 wherein the receiver further includes a de-partitioning module thatreconstructs the video frame from the partitioned pixels in eachreceived packet.
 33. The system of claim 26 wherein the receiver furtherincludes a decoder that decodes the encoded pixels in received packets.34. A wireless transmitter comprising: a partitioning module inputsuncompressed video pixels from a video frame, partitions the video frameinto a plurality of pixel sets, and partitions geographicallyneighboring pixels of each pixel set into different partitions based onpixel indexes, wherein the geographically neighboring pixels are eachpositioned directly next to one another; an error detection informationgenerator calculates error detection data for each packet and appendsthe error detection data to the packet before transmission; and apacketization module places the pixels from different partitions intodifferent packets for separate transmission over a wireless channel,wherein the geographically neighboring pixels of each pixel set arepartitioned from one another and placed into the different packets suchthat each different packet comprises non-neighboring adjacent pixels,wherein partitions geographically neighboring pixels of each pixel setinto different partitions based on pixel indexes comprises partitioningbased on multiple pixel index types comprising combinations of even andodd pixel indexes.
 35. The transmitter of claim 34 wherein thepartitioning module partitions the pixels such that pixels with minimalspatial distance are placed into different packets for separatetransmission over the wireless channel.
 36. The transmitter of claim 35wherein: the partitioning module partitions the pixels into K differentpartitions, wherein K is a positive integer; the packetization moduleselects the value of an n^(th) pixel at every K pixel block as baseinformation, and for each block, places the base information in a packetas BASE pixels, wherein n is a positive integer; and the transmitterfurther includes an encoder that encodes information of other pixels inthe block as DIFF pixels, and places the DIFF pixels in another packet.37. The transmitter of claim 35 wherein the encoder performs encodingusing DPCM encoding.
 38. The transmitter of claim 35 wherein the encoderperforms encoding by bXOR encoding.
 39. The transmitter of claim 35wherein the encoder eliminates MSBs with zero values beforetransmission.
 40. The transmitter of claim 35 wherein the encodertruncates high order zero bits of encoded DIFF pixels.
 41. Thetransmitter of claim 35 wherein the encoder performs RLC for the DIFFpixels and re-orders the bit order in each packet to carry DIFF pixels.42. A wireless receiver comprising: an error detection module receivespackets of video pixel information and checks for corrupt packets; andan error recovery module recovers a corrupt pixel in a corrupt packetusing corresponding pixel information in other received packets thatcontain geographically neighboring spatially correlated pixels, whereinthe geographically neighboring spatially correlated pixels are eachpositioned directly next to one another in a partitioned pixel set priorto being placed into the packets of video pixel information, whereindifferent packets include different adjacent spatially correlated pixelsof a partitioned pixel set of an uncompressed video frame, wherein thegeographically neighboring spatially correlated pixels of eachpartitioned pixel set are partitioned from one another based on pixelindexes and are placed into different packets such that each differentpacket comprises non-neighboring adjacent pixels, wherein thepartitioning the geographically neighboring spatially correlated pixelsof each partitioned pixel set based on pixel indexes comprisespartitioning based on multiple pixel index types comprising combinationsof even and odd pixel indexes.
 43. The receiver of claim 42 wherein thepackets include video pixels that form partitions of neighboringspatially correlated pixels in the video frame.
 44. The receiver ofclaim 43 further comprising a de-partitioning module that reconstructsthe video frame partitions from the partitioned pixels in a plurality ofreceived packets.
 45. The receiver of claim 42 wherein the receiverfurther includes a decoder that decodes encoded pixels in the receivedpackets.
 46. The receiver of claim 42 wherein the error recovery module:determines a difference between each pixel in a corrupt packet and acorresponding neighboring pixel in an adjacent non-corrupt packet, suchthat if the difference is greater than a threshold, the error recoverymodule corrects a corrupt pixel using pixel information in the adjacentnon-corrupt packet.
 47. The receiver of claim 46 wherein the errorrecovery module corrects each corrupt pixel by replacing the corruptpixel with a corresponding neighboring pixel in the adjacent non-corruptpacket.
 48. A method of receiving uncompressed video over a wirelesschannel, comprising: receiving packets of video pixel information,wherein different packets include different adjacent neighboringspatially correlated pixels of a partitioned pixel set of anuncompressed video frame, wherein the adjacent neighboring spatiallycorrelated pixels are each positioned directly next to one another inthe partitioned pixel set, wherein the neighboring spatially correlatedpixels of each partitioned pixel set are partitioned from one anotherbased on pixel indexes and placed into the different packets such thateach different packet comprises non-neighboring adjacent pixels;decoding encoded pixels in the received packets; checking for corruptpackets; and recovering a corrupt pixel in a corrupt packet usingcorresponding pixel information in other received packets that containneighboring spatially correlated pixels, wherein the partitioning theneighboring spatially correlated pixels of each partitioned pixel setbased on pixel indexes comprises partitioning based on multiple pixelindex types comprising combinations of even and odd pixel indexes. 49.The method of claim 48, wherein the packets include video pixels thatform partitions of adjacent neighboring spatially correlated pixels inthe video frame, and further comprising reconstructing the video framepartitions from the partitioned pixels in a plurality of receivedpackets.
 50. The method of claim 49 wherein recovering a corrupt pixelfurther comprises: determining a difference between each pixel in acorrupt packet and a corresponding neighboring pixel in an adjacentnon-corrupt packet; and if the difference is greater than a thresholdvalue, then correcting a corrupt pixel using pixel information in theadjacent non-corrupt packet.
 51. The method of claim 50 whereincorrecting a corrupt pixel further comprises correcting each corruptpixel by replacing the corrupt pixel with a corresponding originalneighboring pixel in the adjacent non-corrupt packet.
 52. The method ofclaim 1, wherein the neighboring spatially correlated pixels compriseadjacent geographically neighboring pixels that are each positioneddirectly next to one another either horizontally or vertically.
 53. Themethod of claim 52, wherein partitioning spatially correlatedneighboring pixels into different partitions comprises horizontalpartitioning adjacent spatially correlated neighboring pixels into oneor more different partitions, wherein each of the spatially correlatedneighboring pixels that are positioned directly next to one another areseparated into the different packets.
 54. The method of claim 52,wherein partitioning spatially correlated neighboring pixels intodifferent partitions comprises vertical partitioning adjacent spatiallycorrelated neighboring pixels into one or more different partitions,wherein each of the spatially correlated neighboring pixels that arepositioned directly next to one another are separated into the differentpackets.
 55. The method of claim 52, wherein partitioning spatiallycorrelated neighboring pixels into different partitions comprises acombination of horizontal and vertical partitioning adjacent spatiallycorrelated neighboring pixels into one or more different partitions,wherein each of the spatially correlated neighboring pixels that arepositioned directly next to one another are separated from one anotherand partitioned into the different packets.
 56. The method of claim 1,wherein neighboring spatially correlated pixels comprise directlyadjacent pixels that are each individually positioned directly next toone another.
 57. The method of claim 1, wherein placing pixels from thedifferent partitions into different packets comprises distributing ynumber of spatially correlated pixels into z number of different packetswhere y≠z.
 58. The method of claim 1, wherein the neighboring spatiallycorrelated pixels of each pixel set are partitioned from one another andplaced into the different packets such that each different packetcomprises pixels from each pixel set that are non-neighboring adjacentpixels.
 59. The method of claim 1, wherein the neighboring spatiallycorrelated pixels of each pixel set are partitioned from one another andplaced into the different packets such that each different packetcomprises alternating pixels from each pixel set that were originallyneighboring adjacent pixels.
 60. The method of claim 4, whereinpartitioning further includes portioning the pixels into 2×2 blocks, andplacing each pixel in each block in a different packet such that each ofthe pixels in a 2×2 block are individually separated from one anotherand placed into different packets, wherein each packet comprisesnon-neighboring pixels from each original block.